منابع مشابه
Digitizing Interval Duration Logic
Interval Duration Logic, (IDL), is a dense time logic for specifying properties of real-time systems. Its validity is undecidable. A corresponding discrete-time logic QDDC has decidable validity. In this paper, we consider a reduction of IDL validity question to QDDC validity using notions of digitization. A new notion of Strong Closure under Inverse Digitization, SCID, is proposed. It is shown...
متن کاملInterval Duration Logic: Expressiveness and Decidability
We investigate a variant of dense-time Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Duration Logic, (IDL), whose models are timed state sequences [1]. A subset LIDL of IDL consisting only of located time constraints is presented. As our main result, we show that the models of an LIDL formula can be capt...
متن کاملBounded Validity Checking of Interval Duration Logic
A rich dense-time logic called Interval Duration Logic(IDL) is useful for specifying quantitative properties of timed systems. The logic is undecidable in general. However, several approaches can be used for checking validity (and model checking) of IDL formulae in practice. In this paper, we propose bounded validity checking of IDL formulae by polynomially reducing this to finding un-satisfyin...
متن کاملIndu : an Interval & Duration Network
The signiicance of representing duration information along with the qualitative information of the time intervals is well argued in the literature. A new framework INDU (INterval and DUration) network consisting of 25 basic relations, is proposed here. INDU can handle qualitative information of time interval and duration in one single structure. It inherits many interesting properties of Allen'...
متن کاملInterval-Based Possibilistic Logic
Possibilistic logic is a well-known framework for dealing with uncertainty and reasoning under inconsistent knowledge bases. Standard possibilistic logic expressions are propositional logic formulas associated with positive real degrees belonging to [0,1]. However, in practice it may be difficult for an expert to provide exact degrees associated with formulas of a knowledge base. This paper pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80480-8